Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 76/115

Q: Who Invented The vEB also known as Van Emde Boas Tree?
A. Peter Van Emde Boas
B. Samuel F. B. Morse
C. Friedrich Clemens Gerke
D. Alexander Morse
Solution: The Van Emde Boas Tree data structure is also popularly known as Van Emde Boas Priority Queue. This data structure implements the array associatively for the given integer keys. It was formulated by Peter Van Emde Boas.
Q: What is the other name or Van Emde Boas Tree data structure?
A. Van Emde Boas Array
B. Van Emde Boas Stack
C. Van Emde Boas Priority Queue
D. Van Emde Boas Heap
Solution: The Van Emde Boas Tree data structure is also popularly known as Van Emde Boas Priority Queue. This data structure implements the array associatively for the given integer keys. It was formulated by Peter Van Emde Boas.
Q: What is the time complexity for storing the maximum number of elements in Van Emde Boas tree if M is the maximum number of elements?
A. O (log M)
B. O (M!)
C. O (M)
D. O (1)
Solution: In order to store the maximum number of elements in Van Emde Boas data structure where M is the maximum number of elements, the tree has great efficiency for storing them. So the time complexity for worst case is found to be O (M).
Q: Does Van Emde Boas data structure perform all operation in O (log (log M)) time where M = 2m.
A. True
B. False
C. 
D. 
Solution: All the operations performed on the Van Emde Boas tree with an associative array like Insertion, Deletion, Searching and many more can be performed in O (log (log M)) time where M = 2m.
Q: What is the time complexity for searching a key or integer in Van Emde Boas data structure?
A. O (log M!)
B. O (M!)
C. O (M2)
D. O (log (log M))
Solution: In order to search a key or integer in the Van Emde Boas data structure, the operation can be performed on an associative array. Hence, the time complexity for searching a key or integer in Van Emde Boas data structure is O (log (log M)).
Q: Which type of tree does Van Emde Boas require to perform basic operations?
A. Unbalanced
B. Balanced
C. Complete
D. Non – Binary
Solution: The Van Emde Boas Tree data structure is also popularly known as Van Emde Boas Priority Queue. This data structure implements the array associatively for the given integer keys. It was formulated by Peter Van Emde Boas. It is a non – binary type of tree.
Q: What is the time complexity for inserting a key or integer in Van Emde Boas data structure?
A. O (log M!)
B. O (M!)
C. O (M2)
D. O (log (log M))
Solution: In order to insert a key or integer in the Van Emde Boas data structure, the operation can be performed on an associative array. Hence, the time complexity for inserting a key or integer in Van Emde Boas data structure is O (log (log M)).
Q: In which year was Van Emde Boas tree invented?
A. 1972
B. 1973
C. 1974
D. 1975
Solution: The Van Emde Boas Tree data structure is also popularly known as Van Emde Boas Priority Queue. This data structure implements the array associatively for the given integer keys. It was formulated by Peter Van Emde Boas in 1975.
Q: What is the time complexity for deleting a key or integer in Van Emde Boas data structure?
A. O (log M!)
B. O (log (log M))
C. O (M!)
D. O (M2)
Solution: In order to delete a key or integer in the Van Emde Boas data structure, the operation can be performed on an associative array. Hence, the time complexity for deleting a key or integer in Van Emde Boas data structure is O (log (log M)).
Q: Which operation find the value associated with a given key?
A. Insert
B. Find Next
C. Look up
D. Delete
Solution: This data structure implements an abstract data type called associative array for the given integer keys. Hence, to find the value associated with a given key, Look Up operation is performed.

You Have Score    /10